Event Clock Automata: From Theory to Practice
نویسندگان
چکیده
Event clock automata (ECA) are a model for timed languages that has been introduced by Alur, Fix and Henzinger as an alternative to timed automata, with better theoretical properties (for instance, ECA are determinizable while timed automata are not). In this paper, we revisit and extend the theory of ECA. We first prove that no finite time abstract language equivalence exists for ECA, thereby disproving a claim in the original work on ECA. This means in particular that regions do not form a time abstract bisimulation. Nevertheless, we show that regions can still be used to build a finite automaton recognizing the untimed language of an ECA. Then, we extend the classical notions of zones and DBMs to let them handle event clocks instead of plain clocks (as in timed automata) by introducing event zones and Event DBMs (EDBMs). We discuss algorithms to handle event zones represented as EDBMs, as well as (semi-) algorithms based on EDBMs to decide language emptiness of ECA.
منابع مشابه
State Clock Logic : a Decidable Real-time Logic State Clock Logic: a Decidable Real-time Logic ?
In this paper we deene a real-time logic called SC logic. This logic is deened in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al 6]. Unlike timed automata 4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A...
متن کاملState Clock Logic: A Decidable Real-Time Logic
In this paper we deene a real-time logic called SC logic. This logic is deened in the framework of State Clock automata, the state variant of the Event Clock automata of Alur et al 6]. Unlike timed automata 4], they are complementable and thus language inclusion becomes decidable. SC automata and SC logic are less expressive than timed automata and MITL but seem expressive enough in practice. A...
متن کاملEvent-Clock Automata: A Determinizable Class of Timed Automata
We introduce event-recording automata. An event-recording automaton is a timed automaton that contains, for every event a, a clock that records the time of the last occurrence of a. The class of event-recording automata is, on one hand, expressive enough to model ( nite) timed transition systems and, on the other hand, determinizable and closed under all boolean operations. As a result, the lan...
متن کاملEvent-Clock Visibly Pushdown Automata
Event-clock automata is a determinizable subclass of timed automata, where the clock valuations are determined by the input instead of by the transition relation. In this note, we propose event-clock visibly pushdown automata (ECVPAs) as a proper extension of event-clock automata. The class of ECVPAs is sufficiently expressive to model real-time pushdown systems, and to specify common non-regul...
متن کاملA Kleene-Schützenberger Theorem for Weighted Event-Clock Automata
We present a Kleene-Schützenberger-Theorem for weighted event-clock automata, i.e., we show that the class of recognizable timed series coincides with the class of rational timed series. The result generalizes Kleene’s famous theorem and its extensions to the classes of weighted automata and event-clock automata. For proving the theorem, we use the method of a recent work on the class of weight...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011